On Equivalence of Binary Asymmetric Channels Regarding the Maximum Likelihood Decoding
نویسندگان
چکیده
منابع مشابه
On Equivalence of Binary Asymmetric Channels regarding the Maximum Likelihood Decoding
This work concerns with the n-fold binary asymmetric channels (BACn). An equivalence relation between two channels can be characterized by both having the same decision criterion when maximum likelihood is considered. We introduce here a function S (the BAC-function) such that the parameters (p, q) of the binary channel which determine equivalent channels belong to certain region delimited by i...
متن کاملMaximum Likelihood Decoding of Convolutional Codes for Non-Gaussian Channels
The Viterbi algorithm plays a fundamental role in the design of receivers for digital communication systems corrupted by Gaussian noise. This algorithm arises as the maximum likelihood sequence detector of the transmitted data symbols in several applications, including equalization for channels subject to intersymbol interference, multiuser communications, and the detection of convolutionally e...
متن کاملOn-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel
In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کاملMaximum Likelihood Decoding of Reed Solomon Codes
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2802923